Multiobjective fractional programming problems and the sufficient condition involving Hb – (p, r)-η- invex function
نویسندگان
چکیده
On the basis of arcwise connected convex functions and ( p , r ) −η - invex functions, we established H b –( p, –η- functions. Based on generalized assumption new solutions a class multiobjective fractional programming problems are studied, sufficient optimality condition for feasible to be efficient proved.
منابع مشابه
Generalized (α, Β, Γ, Η, Ρ, Θ)-invex Functions in Semiinfinite Fractional Programming. Part I: Sufficient Optimality Conditions
subject to Gj(x, t) ≤ 0 for all t ∈ Tj , j ∈ q, Hk(x, s) = 0 for all s ∈ Sk, k ∈ r, x ∈ X, where q and r are positive integers, X is a nonempty open convex subset of Rn (n-dimensional Euclidean space), for each j ∈ q ≡ {1, 2, . . . , q} and k ∈ r, Tj and Sk are compact subsets of complete metric spaces, f and g are real-valued functions defined on X, for each j ∈ q, z → Gj(z, t) is a real-value...
متن کاملOptimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
متن کاملSufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...
متن کاملSymmetric duality for multiobjective fractional variational problems involving cones
In this paper, a pair of multiobjective fractional variational symmetric dual problems over cones is formulated. Weak, strong and converse duality theorems are established under generalized F-convexity assumptions. Moreover, self duality theorem is also discussed. 2007 Elsevier B.V. All rights reserved.
متن کاملMULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEMS INVOLVING GENERALIZED d - TYPE - I n - SET FUNCTIONS
For 1 1 ( ) ( )∈! m m m x = x ,...,x , y = y ,...,y we put ≤ x y iff i i x y ≤ for each { } 1 2 ∈ i M = , ,...,m ; ≤ x y iff ≤ i i x y for each i M ∈ , with x y; x < y ≠ iff i i x < y for each i M ∈ . We write + ∈! m x iff 0 ≥ x . For an arbitrary vector n x∈! and a subset J of the index set { } 1 2 n , ,..., , we denote by J x the vector with components j x , j J ∈ . Let ( ) μ X , Γ, be a fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC web of conferences
سال: 2021
ISSN: ['2261-236X', '2274-7214']
DOI: https://doi.org/10.1051/matecconf/202133608015